Buffer stocks are better stabilizers than quotas
نویسندگان
چکیده
منابع مشابه
Two Are Better than One?
This paper uses Markov-switching specifications to create a hybrid model with time-varying loading on each of chartist and fundamentalist approaches. The empirical data include the U.S. dollar exchange rates of four Asian tiger countries’ currencies including NTD, SGD, HKD and KOW from 1980 to 2000. Our empirical findings are consistent with the following notions. First, the forecasting perform...
متن کاملLanding Fees vs Harvest Quotas with Uncertain Fish Stocks
This paper analyzes the relative performance of two market-based fisheries management instruments in the presence of a stochastic stock-recruitment relation. Regulators are forced to choose either a fee per fish landed or a quota on the total fish harvest at a time when they are uncertain what will be the stock of fish recruits that will actually materialize during the next fishing period. With...
متن کاملWhen two kinases are better than one
When two kinases are better than one V idal-Eychenié et al. describe how two protein kinases team up to respond to DNA damage at stalled replication forks. DNA-dependent protein kinase catalytic subunit (DNA-PKcs) promotes the repair of DNA double-strand breaks (DSBs) by nonhomologous end joining (NHEJ). The ATR kinase, on the other hand, initiates cell cycle arrest and DNA repair after recogni...
متن کاملSome Multiobjective Optimizers are Better than Others
The No-Free-Lunch (NFL) theorems hold for general multiobjective fitness spaces, in the sense that, over a space of problems which is closed under permutation, any two algorithms will produce the same set of multiobjective samples. However, there are salient ways in which NFL does not generally hold in multiobjective optimization. Previously we have shown that a ‘free lunch’ can arise when comp...
متن کاملMultiple Random Oracles Are Better Than One
We study the problem of learning k-juntas given access to examples drawn from a number of different product distributions. Thus we wish to learn a function f : {−1, 1}n → {−1, 1} that depends on k (unknown) coordinates. While the best known algorithms for the general problem of learning a k-junta require running time of n poly(n, 2), we show that given access to k different product distribution...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of International Economics
سال: 1981
ISSN: 0022-1996
DOI: 10.1016/0022-1996(81)90047-7